A Space Lower Bound for Dynamic Approximate Membership Data Structures
نویسندگان
چکیده
منابع مشابه
A Sharp Lower Bound for Mixed-membership
The goal is to estimate {πi, 1 ≤ i ≤ n} (i.e., membership estimation). We model the network with the degree-corrected mixed membership (DCMM) model [8]. Since for many natural networks, the degrees have an approximate power-law tail, we allow severe degree heterogeneity in our model. For any membership estimation {π̂i, 1 ≤ i ≤ n}, since each πi is a probability mass function, it is natural to me...
متن کاملLower bound techniques for data structures
We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: • the first Ω(lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; • for static data structures, the first separation between linear and polynomial space. Specifically, for some problems that have constant query time when polynomial...
متن کاملSuccinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
The retrieval problem is the problem of associating data with keys in a set. Formally, the data structure must store a function f : U → {0, 1}r that has specified values on the elements of a given set S ⊆ U , |S| = n, but may have any value on elements outside S. Minimal perfect hashing makes it possible to avoid storing the set S, but this induces a space overhead of Θ(n) bits in addition to t...
متن کاملSuccinct Data Structures for Retrieval and Approximate Membership
The retrieval problem is the problem of associating data with keys in a set. Formally, the data structure must store a function f : U → {0, 1} that has specified values on the elements of a given set S ⊆ U , |S| = n, but may have any value on elements outside S. All known methods (e. g. those based on perfect hash functions), induce a space overhead of Θ(n) bits over the optimum, regardless of ...
متن کاملApproximate Dynamic Analysis of Structures for Earthquake Loading Using FWT
Approximate dynamic analysis of structures is achieved by fast wavelet transform (FWT). The loads are considered as time history earthquake loads. To reduce the computational work, FWT is used by which the number of points in the earthquake record are reduced. For this purpose, the theory of wavelets together with filter banks are used. The low and high pass filters are used for the decompositi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/120867044